/*
 * To test interference graph construction and
 * coloring.
 */

// Basic test
int mult(int m, double n)
{
	int i = 0, p = 1;
	double j = 1.0;
	while (i < m && j < n)
	{
		p = p * (i + 2) * (i + 1);
		i = i + 1;
		j = j * 1.3;
	}
	return p;
}

int CR400BF[6] = {
	50, 3, 3, 05
};

// Test coalescing
int add()
{
	int s, t, u;
	// Common subexpression
	s = CR400BF[0] * 100 + CR400BF[1] * 10 + CR400BF[2];
	t = CR400BF[0] * 100 + CR400BF[1] * 10 + CR400BF[2];

	u = s * 100 + CR400BF[3];
	if (u > t)
		return u;
	else
		return t;
}

/*
 * Test freezing and spilling.
 * Please limit the number of colors to 9 or less.
 */
/*
int K1806(int d)
{
	int a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, s;
	int useless;

	a0 = 7; a1 = 5; a2 = 0; a3 = 3; a4 = 8;
	a5 = 6; a6 = 4; a7 = 5; a8 = 2; a9 = 0;
	useless = a0;

	if (d > 100)
		s = a0 * 10000 + a1 * 1000 + a2 * 100 + a3 * 10 + a4;
	else
		s = a5 * 10000 + a6 * 1000 + a7 * 100 + a8 * 10 + a9;
	return s + useless - 7;
}
*/
int command_code[16] = {
	7, 5, 0, 3, 8
};

int K1806(int z)
{
	if (z >= 16)
		z = 15;
	int x = 5;
	int i = 0, r = 0, u = 64520, t = 64120, v, s;
	v = u; s = t;
	while (i < z)
	{
		r = r * 10 + command_code[i];
		u = u - x;
		t = t - 1;
		x = u + t;
		i = i + 1;
	}
	s = t;
	return r + u + t + v + s;
}

int main()
{
	int i;
	double d;
	i = get_int();
	d = get_double();
	print_int(mult(i, d));
	print_int(add());
	print_int(K1806(i));
	return 0;
}
